Latin squares and critical sets of minimal size
نویسندگان
چکیده
IsotoIHsl:n that lower bounds for infinite N of order n. hand or computer, strong critical sets of minimum nOn-lS01110Tnitnc reduced latin squares of order less than or of order 6. These latin squares have been taken from 129 onwards. We summarise our results in Table the numbering system listed by Denes and Keedwell latin squares. This numbering system is based on the ,<:n,,-r1i',rrHl1<:rn classes of the latin squares and in detail on pages 128 114 and 129 of [3]. These numbers are listed as the class and are given in column two of Table 1. of critical sets of minimum cardinality for each latin square are in the Appendix.
منابع مشابه
Minimal critical sets for some small Latin squares
A general algorithm for finding a minimal critical set for any latin square is presented. By implementing this algorithm, minimal critical sets for all the latin squares of order six have been found. In addition, this algorithm is used to prove that the size of the minimal critical set for a back circulant latin square of order seven is twelve, and for order nine is twenty. These results provid...
متن کاملA new bound on the size of the largest 2-critical set in a latin square
A critical set is a partial latin square that has a unique completion to a latin square of the same order, and is minimal in this property. If P is a critical set in a latin square L, then each element of P must be contained in a latin trade Q in L such that |P ∩ Q| = 1. In the case where each element of P is contained in an intercalate (latin trade of size 4) Q such that |P∩Q| = 1 we say that ...
متن کاملMinimal and near-minimal critical sets in back-circulant latin squares
A critical set in a latin square is a subset of its elements with the following properties: 1) No other latin square exists which also contains that subset. 2) No element may be deleted without destroying property 1. Let scs(n) denote the smallest possible cardinality of a critical set in an n × n latin square. It is conjectured that scs(n) = n/4 , and that only the back-circulant latin square ...
متن کاملOn the spectrum of critical sets in latin squares of order 2
Suppose that L is a latin square of order m and P ⊆ L is a partial latin square. If L is the only latin square of order m which contains P , and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a...
متن کاملSteiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 4 شماره
صفحات -
تاریخ انتشار 1991